Models and Algorithms for Stochastic Online Scheduling
نویسندگان
چکیده
منابع مشابه
Models and Algorithms for Stochastic Online Scheduling
We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that jobs arrive online, and there is no knowledge about the jobs that will arrive in the future. The mod...
متن کاملGreed Works - Online Algorithms For Unrelated Machine Stochastic Scheduling
We derive the first performance guarantees for a combinatorial online algorithm that schedules stochastic, nonpreemptive jobs on unrelated machines to minimize the expectation of the total weighted completion time. Prior work on unrelated machine scheduling with stochastic jobs was restricted to the offline case, and required sophisticated linear or convex programming relaxations for the assign...
متن کاملCoping with Incomplete Information in Scheduling - Stochastic and Online Models
Incomplete information is an omnipresent issue when dealing with realworld optimization problems. Typically, such limitations concern the uncertainty of given data or the complete lack of knowledge about future parts of a problem instance. Our work is devoted to investigations on how to cope with incomplete information when solving scheduling problems. The particular problem class we consider i...
متن کاملStochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give randomized as well as deterministic online and off-line algorithms that have the best known performance guarantees in either setting, deterministic and offline or randomized and online. Our analysis is based on a nov...
متن کاملApproximation Results for Preemptive Stochastic Online Scheduling
We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem. Our policies apply to the recentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2006
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1060.0201